import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: a1227
 * Date: 2022-08-31
 * Time: 16:14
 */
public class Demo {
    /**
     * 矩阵元素定位
     * @param args
     */
    /*
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int [][] ary = new int[n][m];
        for(int i = 0; i < ary.length; i++){
            for(int j = 0; j < ary[i].length; j++){
                ary[i][j] = scan.nextInt();
            }
        }
        int x = scan.nextInt();
        int y = scan.nextInt();
        x -= 1;
        y -= 1;
        System.out.println(ary[x][y]);
    }
     */

    /**
     * 最高身高
     * @param args
     */
    /*
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int [][] array = new int[n][m];
        int max = 0;
        int maxn = 0;
        int maxm = 0;
        for(int i = 0; i < array.length; i++){
            for(int j = 0; j < array[i].length; j++){
                array[i][j] = scan.nextInt();
                if(max < array[i][j]){
                    max = array[i][j];
                    maxn = i + 1;
                    maxm = j + 1;
                }
            }
        }
        System.out.println(maxn+" "+maxm);
    }
     */

    /**
     * 矩阵相等判定
     * @param args
     */
    /*
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        int [][] ary1 = new int[n][m];
        int [][] ary2 = new int[n][m];
        for(int i = 0; i < ary1.length; i++){
            for(int j = 0; j < ary1[i].length; j++){
                ary1[i][j] = scan.nextInt();
            }
        }
        for(int i = 0; i < ary2.length; i++){
            for(int j = 0; j < ary2[i].length; j++){
                ary2[i][j] = scan.nextInt();
            }
        }
        for(int i = 0; i < ary1.length; i++){
            for(int j = 0; j < ary1[i].length; j++){
                if(ary1[i][j] != ary2[i][j]){
                    System.out.println("No");
                    return ;
                }
            }
        }
        System.out.println("Yes");
        return ;
    }
     */
}
